Career Path Suggestion using String Matching and Decision Trees
نویسندگان
چکیده
منابع مشابه
Career Path Suggestion using String Matching and Decision Trees
High school and college graduates seemingly are often battling for the courses they should major in order to achieve their target career. In this paper, we worked on suggesting a career path to a graduate to reach his/her dream career given the current educational status. Firstly, we collected the career data of professionals and academicians from various career fields and compiled the data set...
متن کاملCareer-Path Analysis Using Optimal Matching and Self-Organizing Maps
This paper is devoted to the analysis of career paths and employability. The state-of-the-art on this topic is rather poor in methodologies. Some authors propose distances well adapted to the data, but are limiting their analysis to hierarchical clustering. Other authors apply sophisticated methods, but only after paying the price of transforming the categorical data into continuous, via a fact...
متن کاملString Matching with Metric Trees Using an Approximate Distance
Searching in a large data set those strings that are more similar, according to the edit distance, to a given one is a time-consuming process. In this paper we investigate the performance of metric trees, namely the M-tree, when they are extended using a cheap approximate distance function as a filter to quickly discard irrelevant strings. Using the bag distance as an approximation of the edit ...
متن کاملModelling the Eulerian Path Problem using a String Matching Framework
The well-known Eulerian path problem can be solved in polynomial time (more exactly, there exists a linear time algorithm for this problem) [3]. In this paper, we model the problem using a string matching framework, and then initiate an algorithmic study on a variant of this problem, called the (2, 1)–STRING–MATCH problem (which is actually a generalization of the Eulerian path problem). Then, ...
متن کاملString Matching using Inverted Lists
This paper proposes a new solution to string matching problem. This solution constructs an inverted list representing a string pattern to be searched for. It then uses a new algorithm to process an input string in a single pass. The preprocessing phase takes 1) time complexity O(m) 2) space complexity O(1) where m is the length of pattern. The searching phase time complexity takes 1) O(m+α ) in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/20569-2964